Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes
نویسندگان
چکیده
منابع مشابه
Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes
We present a highly parallel, linearly scalable technique of kd-tree construction for ray tracing of dynamic geometry. We use conventional kd-tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd-tree quality for rendering stage. The algorithm builds a kd-tree from scratch each fra...
متن کاملA Fast Kd-tree Construction for Ray Tracing based on Efficient Ray Distribution
Construction of effective acceleration structure is an essential and challenging problem in ray tracing. The surface area heuristic (SAH), regarded as the standard cost function for construction, is based on the assumption that rays are uniformly distributed. This simplification ignoring actual ray distribution results in a reduction both on construction and rendering performance. Unlike previo...
متن کاملHybrid CPU/GPU KD-Tree Construction for Versatile Ray Tracing
We propose an hybrid CPU-GPU ray-tracing implementation based on an optimal Kd-Tree as acceleration structure. The construction and traversal of this KD-tree takes benefit from both the CPU and the GPU to achieve high-performance ray-tracing on mainstream hardware. Our approach, flexible enough to use only a single computing unit (CPU or GPU), is able to efficiently distribute workload between ...
متن کاملParallel SAH k-D Tree Construction for Fast Dynamic Scene Ray Tracing
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations between rays and the primitives. The highest quality k-D tree can be obtained using greedy cost optimization based on a surface area heuristc (SAH). While the high quality enables very fast ray tracing times, a key drawb...
متن کاملFast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depends, among other techniques, upon the data structures used in the background. kd-trees are some of the most commonly used data structures for accelerating ray tracing algorithms. Data structures using cost optimization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2007
ISSN: 0167-7055,1467-8659
DOI: 10.1111/j.1467-8659.2007.01062.x